Obstructions to extending almost $X$-structures
نویسندگان
چکیده
منابع مشابه
Extending Obstructions to Noncommutative Functorial Spectra
Any functor from the category of C*-algebras to the category of locales that assigns to each commutative C*-algebra its Gelfand spectrum must be trivial on algebras of n-by-n matrices for n ≥ 3. This obstruction also applies to other spectra such as those named after Zariski, Stone, and Pierce. We extend these no-go results to functors with values in (ringed) topological spaces, (ringed) topose...
متن کاملAlmost All Friendly Matrices Have Many Obstructions
A symmetric m×m matrix M with entries taken from {0, 1, ∗} gives rise to a graph partition problem, asking whether a graph can be partitioned into m vertex sets matched to the rows (and corresponding columns) of M such that, if Mij = 1, then any two vertices between the corresponding vertex sets are joined by an edge, and if Mij = 0 then any two vertices between the corresponding vertex sets ar...
متن کاملGraph minors. X. Obstructions to tree-decomposition
Graphs in this paper are finite and undirected and may have loops or multiple edges. The vertexand edge-sets of a graph G are denoted by V(G) and E(G). If G, = ( V1, E,), G2 = ( V2, E2) are subgraphs of a graph G, we denote the graphs (V1n V2,E1nE,) and (V,u V2, EluEZ) by G,nG, and G, u GZ, respectively. A separation of a graph G is a pair (G,, G2) of subgraphs with G1 u G2 = G and E(G1 n G2) =...
متن کاملReducing almost Lagrangian structures and almost CR geometries to partially integrable structures
This paper demostrates a method for analysing almost CR geometries (H, J), by uniquely defining a partially integrable structure (H,K) from the same data. Thus two almost CR geometries (H,J) and (H ′, J ′) are equivalent if and and only if they generate isomorphic induced partially integrable CR geometries (H,K) and (H ′, K′), and the set of CR morphisms between these spaces contains an element...
متن کاملExtending Garbage Collection to Complex Data Structures
Objects that are pointer reachable through a complex data structure may be inaccessible to the external program, depending on the semantics of the structure. Failure to recognize the unusual behavior of complex data structures causes memory leaks in any collector that relies on pointer reachability to locate garbage. We extend the definition of reachability to distinguish between objects that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1969
ISSN: 0019-2082
DOI: 10.1215/ijm/1334250797